Complete Boolean algebra

Results: 108



#Item
81Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Algebraic structure / Decision problem / Algebra / Mathematics / Theoretical computer science / Mathematical logic

An ExpTime Tableau-based Decision Procedure for ALCQI Yu Ding and Volker Haarslev Concordia University, Montreal, Canada 1

Add to Reading List

Source URL: www.ceur-ws.org

Language: English - Date: 2007-05-22 01:39:22
82Forcing / Set theory / Tree / Cardinal number / Complete Boolean algebra / Symbol / Bisimulation / Constructible universe / Weakly compact cardinal / Mathematical logic / Mathematics / Large cardinals

Weak Bisimulation Approximants Will Harwood and Faron Moller Department of Computer Science, Swansea University Abstract. Bisimilarity , a canonical notion of equivalence between processes, is defined co-inductively, but

Add to Reading List

Source URL: www-compsci.swan.ac.uk

Language: English - Date: 2006-05-01 15:35:42
83Boolean algebra / Formal methods / Logic in computer science / Electronic design automation / NP-complete problems / Boolean satisfiability problem / Conjunctive normal form / Binary decision diagram / Formal equivalence checking / Theoretical computer science / Mathematics / Applied mathematics

Combinational Equivalence Checking Using Satisfiability and Recursive Learning João Marques-Silva

Add to Reading List

Source URL: eprints.soton.ac.uk

Language: English - Date: 2009-12-08 13:36:52
84Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Maximum satisfiability problem / Satisfiability / 2-satisfiability / Theoretical computer science / Mathematics / Applied mathematics

Satisfiability Suggested Format Last revision: May 8, 1993

Add to Reading List

Source URL: www.domagoj-babic.com

Language: English - Date: 2008-09-07 21:05:56
85Boolean algebra / Logic in computer science / NP-complete problems / Combinatorics / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Partition / True quantified Boolean formula / Theoretical computer science / Mathematics / Computational complexity theory

Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer

Add to Reading List

Source URL: ovid.cs.depaul.edu

Language: English - Date: 2008-10-05 12:49:10
86Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Satisfiability Modulo Theories / Solver / True quantified Boolean formula / Theoretical computer science / Applied mathematics / Mathematics

Ranking and Reputation Systems in the QBF competition Massimo Narizzano, Luca Pulina, and Armando Tacchella

Add to Reading List

Source URL: www.star.dist.unige.it

Language: English - Date: 2007-12-12 09:04:58
87Complexity classes / NP-complete / Boolean algebra / NP / PP / UP / P / Reduction / Arithmetic circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

Light Up is NP-complete Brandon McPhail February 28, 2005

Add to Reading List

Source URL: people.cs.umass.edu

Language: English - Date: 2007-09-02 12:14:45
88NP-complete problems / Complexity classes / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / 2-satisfiability / NP-complete / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

Theory of Computation Chapter 9 Guan-Shieng Huang

Add to Reading List

Source URL: staffweb.ncnu.edu.tw

Language: English - Date: 2004-02-15 23:56:23
89Algebra / Semiring / Kleene algebra / Complete Boolean algebra / Boolean algebra / Von Neumann algebra / Functor / Sigma-algebra / Complete Heyting algebra / Mathematics / Abstract algebra / Algebraic structures

On Kleene Algebras and Closed Semirings Dexter Kozeny Department of Computer Science

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2012-05-29 09:45:43
90Algebraic structures / Boolean algebra / Category theory / Forcing / Heyting algebra / Functor / Complete Boolean algebra / Adjoint functors / Topos / Mathematics / Abstract algebra / Algebra

A brief introduction to algebraic set theory∗ Steve Awodey

Add to Reading List

Source URL: www.andrew.cmu.edu

Language: English - Date: 2013-10-13 15:36:04
UPDATE